Code Constructions based on Reed-Solomon Codes
نویسندگان
چکیده
Reed–Solomon codes are a well–studied code class which fulfill the Singleton bound with equality. However, their length is limited to the size q of the underlying field Fq. In this paper we present a code construction which yields codes with lengths of factors of the field size. Furthermore a decoding algorithm beyond half the minimum distance is given and analyzed.
منابع مشابه
A general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملQuantum Convolutional Codes Derived From Reed-Solomon and Reed-Muller Codes
Convolutional stabilizer codes promise to make quantum communication more reliable with attractive online encoding and decoding algorithms. This paper introduces a new approach to convolutional stabilizer codes based on direct limit constructions. Two families of quantum convolutional codes are derived from generalized Reed-Solomon codes and from ReedMuller codes. A Singleton bound for pure con...
متن کاملAlmost Independent and Weakly Biased Arrays: Eecient Constructions and Cryptologic Applications
The best known constructions for arrays with low bias are those from 1] and the exponential sum method based on the Weil-Carlitz-Uchiyama bound. They all yield essentially the same parameters. We present new eecient coding-theoretic constructions, which allow far-reaching generalizations and improvements. The classical constructions can be described as making use of Reed-Solomon codes. Our recu...
متن کاملAlmost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same parameters. We present new efficient coding-theoretic constructions, which allow farreaching generalizations and improvements. The classical constructions can be described as making use of Reed-Solomon codes. Our rec...
متن کاملNew constructions of quantum MDS convolutional codes derived from generalized Reed-Solomon codes
Quantum convolutional codes can be used to protect a sequence of qubits of arbitrary length against decoherence. In this paper, we give two new constructions of quantum MDS convolutional codes derived from generalized Reed-Solomon codes and obtain eighteen new classes of quantum MDS convolutional codes. Most of them are new in the sense that the parameters of the codes are different from all th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1706.05830 شماره
صفحات -
تاریخ انتشار 2017